QCD factorization of the four-lepton decay $$B^-\rightarrow \ell \bar{\nu }_\ell \ell ^{(\prime )} \bar{\ell }^{(\prime )}$$
نویسندگان
چکیده
Motivated by the first search for rare charged-current $B$ decay to four leptons, $\ell \bar{\nu}_\ell \ell^{(\prime)} \bar{\ell}^{(\prime)}$, we calculate amplitude with factorization methods. We obtain $B\to \gamma^*$ form factors, which depend on invariant masses of two lepton pairs, at leading power in an expansion $\Lambda_{\rm QCD}/m_b$ next-to-leading order $\alpha_s$, and $\mathcal{O}(\alpha_s^0)$ power. Our calculations predict branching fractions a few times $10^{-8}$ $\ell^{(\prime)} \bar{\ell}^{(\prime)}$ mass-squared bin up $q^2=1~\text{GeV}^2$ $n_+q>3~$GeV. The fraction rapidly drops increasing $q^2$. An important further motivation this investigation has been explore sensitivity rate inverse moment $\lambda_B$ leading-twist meson light-cone distribution amplitude. find that small-$q^2$ bin, is almost comparable $B^- \rightarrow \ell^- \bar{\nu}_\ell\gamma$ when small, but added uncertainty from light-meson intermediate resonance contribution. degrades larger
منابع مشابه
A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملRethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations
This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. Stemming from the notion of (k, l)-anonymity, we introduce (k, l)-anonymous t...
متن کاملOn the prime power factorization of n!
In this paper we prove two results. The first theorem uses a paper of Kim [8] to show that for fixed primes p1, . . . , pk, and for fixed integers m1, . . . ,mk, with pi 6 |mi, the numbers (ep1(n), . . . , epk(n)) are uniformly distributed modulo (m1, . . . ,mk), where ep(n) is the order of the prime p in the factorization of n!. That implies one of Sander’s conjecture from [9], for any set of ...
متن کاملOn the Prime Factorization of Binomial Coefficients
For positive integers n and k, with n>-2k, let (k) = uv, where each prime factor of u is less than k, and each prime factor of v is at least equal to k. It is shown that u < v holds with just 12 exceptions, which are determined . If (k) = UV, where each prime factor of U is at most equal to k, and each prime factor of V is greater than k, then U< V holds with at most finitely many exceptions, 1...
متن کاملPlasticity in the mormyrid ELL
electrosensory lateral line lobe (ELL) of mormyrid electric fish. The mormyrid ELL is one member of a group of cerebellum-like sensory structures found in fish, amphibians and mammals (Fig. 1). These structures possess a molecular layer, an underlying sensory input layer and an intervening layer of large cells. The large cells have apical dendrites that receive input from parallel fibers, and b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Physical Journal C
سال: 2021
ISSN: ['1434-6044', '1434-6052']
DOI: https://doi.org/10.1140/epjc/s10052-021-09388-y